Dual-feature spectrum sensing exploiting eigenvalue and eigenvector of the sampled covariance matrix
نویسندگان
چکیده
منابع مشابه
Quickest Eigenvalue-Based Spectrum Sensing using Random Matrix Theory
We investigate the potential of quickest detection based on the eigenvalues of the sample covariance matrix for spectrum sensing applications. A simple phase shift keying (PSK) model with additive white Gaussian noise (AWGN), with 1 primary user (PU) and K secondary users (SUs) is considered. Under both detection hypotheses H0 (noise only) and H1 (signal + noise) the eigenvalues of the sample c...
متن کاملSparse Covariance Matrix Estimation With Eigenvalue Constraints.
We propose a new approach for estimating high-dimensional, positive-definite covariance matrices. Our method extends the generalized thresholding operator by adding an explicit eigenvalue constraint. The estimated covariance matrix simultaneously achieves sparsity and positive definiteness. The estimator is rate optimal in the minimax sense and we develop an efficient iterative soft-thresholdin...
متن کاملEigenvalue and Eigenvector Analysis of Dynamic Systems
While several methods aimed at understanding the causes of model behavior have been proposed in recent years, formal model analysis remains an important and challenging area in system dynamics. This paper describes a mathematical method to incorporate eigenvectors to the more traditional eigenvalue analysis of dynamic models. The proposed method derives basic formulas that characterize how a ch...
متن کاملSNR-Walls in Eigenvalue-based Spectrum Sensing
Correspondence: bollig@ti.rwth-aachen.de Institute for Theoretical Information Technology, RWTH Aachen University, Kopernikusstraße 16, 52074, Aachen, Germany Full list of author information is available at the end of the article Abstract Various spectrum sensing approaches have been shown to suffer from a so-called SNR-wall, an SNR value below which a detector cannot perform robustly no matter...
متن کاملOn Some Eigenvector-Eigenvalue Relations
This paper generalizes the well-known identity which relates the last components of the eigenvectors of a symmetric matrix A to the eigenvalues of A and of the matrix An−1, obtained by deleting the last row and column of A. The generalizations relate to matrices and to Sturm–Liouville equations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EAI Endorsed Transactions on Cognitive Communications
سال: 2018
ISSN: 2313-4534
DOI: 10.4108/eai.11-5-2018.154702